Online Routing in Convex Subdivisions
نویسندگان
چکیده
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no memory and uses no randomization, (2) no equivalent result is possible for convex subdivisions, (3) there is no competitive online routing algorithm under the Euclidean distance metric in arbitrary triangulations, and (4) there is no competitive online routing algorithm under the link distance metric even when the input graph is restricted to be a Delaunay, greedy, or minimum-weight triangulation.
منابع مشابه
Local Routing in Convex Subdivisions
In various wireless networking settings, node locations determine a network’s topology, allowing the network to be modelled by a geometric graph drawn in the plane. Without any additional information, local geometric routing algorithms can guarantee delivery to the target node only in restricted classes of geometric graphs, such as triangulations. In order to guarantee delivery on more general ...
متن کاملOnline Routing in Triangulations
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorithms, one that works for all Delaunay triangulations and the other that works for all regular triangulations, (2) a randomized memoryless algorithm that works for all triangulations, (3) an O(1) memory algorithm that w...
متن کاملMemoryless routing in convex subdivisions: Random walks are optimal
A memoryless routing algorithm is one in which the decision about the next edge on the route to a vertex t for a packet currently located at vertex v is made based only on the coordinates of v, t, and the neighbourhood, N(v), of v. The current paper explores the limitations of such algorithms by showing that, for any (randomized) memoryless routing algorithm A, there exists a convex subdivision...
متن کاملContents 1 Last Class and Review of Online Gradient
Last week we started the online model of learning, and we talked a bit about various problems that can be modeled, like decision-making using expert advice and online routing. We also discussed online linear separability. So we can solve these problems with online convex optimization model. We also gave the online gradient descent algorithm, and showed how it minimizes regret and proved the fol...
متن کاملAdaptive Planar Point Location
We present a self-adjusting point location structure for convex subdivisions. Let n be the number of vertices in a convex subdivision S. Our structure for S uses O(n) space and processes any online query sequence σ in O(n+ OPT) time, where OPT is the minimum time required by any linear decision tree for answering point location queries in S to process σ. The O(n + OPT) time bound includes the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 12 شماره
صفحات -
تاریخ انتشار 2000